Bound-Consistent Deviation Constraint
نویسندگان
چکیده
Deviation is a recent constraint to balance a set of variables with respect to a given mean. We show that the propagators recently introduced are not bound-consistent when the mean is rational. We introduce bound-consistent propagators running in linear time with respect to the number of variables. We evaluate the improvement in terms of efficiency and pruning obtained with the new propagators on the Balanced Academic Curriculum Problem.
منابع مشابه
A new method for 3-D magnetic data inversion with physical bound
Inversion of magnetic data is an important step towards interpretation of the practical data. Smooth inversion is a common technique for the inversion of data. Physical bound constraint can improve the solution to the magnetic inverse problem. However, how to introduce the bound constraint into the inversion procedure is important. Imposing bound constraint makes the magnetic data inversion a n...
متن کامل3D gravity data-space inversion with sparseness and bound constraints
One of the most remarkable basis of the gravity data inversion is the recognition of sharp boundaries between an ore body and its host rocks during the interpretation step. Therefore, in this work, it is attempted to develop an inversion approach to determine a 3D density distribution that produces a given gravity anomaly. The subsurface model consists of a 3D rectangular prisms of known sizes ...
متن کاملHolographic entropy bound and local quantum field theory.
I show how the holographic entropy bound can be derived from elementary flat-spacetime quantum field theory when the total energy of Fock states is constrained gravitationally. This energy constraint makes the Fock space dimension (whose logarithm is the maximum entropy) finite for both bosons and fermions. Despite the elementary nature of my analysis, it results in an upper limit on entropy in...
متن کاملA Probabilistic Study of Bound Consistency for the Alldifferent Constraint
This paper introduces a mathematical model for bound consistency of the constraint AllDifferent. It allows us to compute the probability that the filtering algorithm effectively removes at least one value in the variable domains. A complete study of the bound consistency properties is then proposed. It identifies several behaviors depending on some macroscopic quantities related to the variable...
متن کاملA constraint programming approach to subgraph isomorphism
ions for sets. Filtering and propagators A simple algorithm exists to find a solution to a CSP. A straightforward idea is to enumerate all assignments of the variables with respect to their domains, and check if the constraints are satisfied. This strategy is correct, but the time to find a solution is exponential. Individual constraints can be used to remove values. Values in the domain of a C...
متن کامل